Degree Distribution of an Inhomogeneous Random Intersection Graph
نویسندگان
چکیده
We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.
منابع مشابه
Degree distribution of a typical vertex in a general random intersection graph
For a general random intersection graph we show an approximation of the vertex degree distribution by a Poisson mixture. key words: intersection graph, random graph, degree distribution
متن کاملThe phase transition in inhomogeneous random intersection graphs
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase transition. We give bounds on the size of the largest components before and after this transition. We also prove that the largest component after the transiti...
متن کاملConnectivity of inhomogeneous random key graphs intersecting inhomogeneous Erdős-Rényi graphs
We study the connectivity of a random graph formed by the intersection of an inhomogeneous random key graph with an inhomogeneous Erdős-Rényi graph. The former graph is naturally induced by a heterogeneous random key predistribution scheme introduced for securing wireless sensor network communications. In this scheme, nodes are divided into r classes according to a probability distribution μ = ...
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملRandom Intersection Graph Process
Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013